Parallel Symbolic Factorization for Sparse LU with Static Pivoting

نویسندگان

  • Laura Grigori
  • James Demmel
  • Xiaoye S. Li
چکیده

This paper presents the design and implementation of a memory scalable parallel symbolic factorization algorithm for general sparse unsymmetric matrices. Our parallel algorithm uses a graph partitioning approach, applied to the graph of |A|+ |A| , to partition the matrix in such a way that is good for sparsity preservation as well as for parallel factorization. The partitioning yields a so-called separator tree which represents the dependencies among the computations. We use the separator tree to distribute the input matrix over the processors using a block cyclic approach and a subtree to sub-processor mapping. The parallel algorithm performs a bottom up traversal of the separator tree. With a combination of right-looking and left-looking partial factorizations, the algorithm obtains one column structure of L and one row structure of U at each step. The algorithm is implemented in C and MPI. From a performance study on large matrices, we show that the parallel algorithm significantly reduces the memory requirement of the symbolic factorization step, as well as the overall memory requirement of the parallel solver. It also often reduces the runtime of the sequential algorithm, which is already relatively small. In general, the parallel algorithm prevents the symbolic factorization step from being a time or memory bottleneck of the parallel solver.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

S+: Efficient 2D Sparse LU Factorization on Parallel Machines

Static symbolic factorization coupled with supernode partitioning and asynchronous computation scheduling can achieve high giga op rates for parallel sparse LU factorization with partial pivoting This paper studies properties of elimination forests and uses them to optimize supernode partitioning amalgamation and execution scheduling It also proposes supernodal matrix multiplication to speed up...

متن کامل

A Comparison of D and D Data Mapping for Sparse LU Factorization with Partial Pivoting

This paper presents a comparative study of two data mapping schemes for parallel sparse LU factorization with partial pivoting on distributed memory machines Our previous work has developed an approach that incorporates static symbolic factoriza tion nonsymmetric L U supernode partitioning and graph scheduling for this problem with D column block mapping The D mapping is commonly considered mor...

متن کامل

Parallel Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures

Gaussian elimination based sparse LU factorization with partial pivoting is important to many scientiic applications, but it is still an open problem to develop a high performance sparse LU code on distributed memory machines. The main diiculty is that partial pivoting operations make structures of L and U factors unpredictable beforehand. This paper presents an approach called S for paralleliz...

متن کامل

Efficient Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures

A sparse LU factorization based on Gaussian elimination with partial pivoting (GEPP) is important to many scientific applications, but it is still an open problem to develop a high performance GEPP code on distributed memory machines. The main difficulty is that partial pivoting operations dynamically change computation and nonzero fill-in structures during the elimination process. This paper p...

متن کامل

Eecient Sparse Lu Factorization with Partial Pivoting on Distributed Memory Architectures

A sparse LU factorization based on Gaussian elimination with partial pivoting (GEPP) is important to many scientiic applications, but it is still an open problem to develop a high performance GEPP code on distributed memory machines. The main diiculty is that partial pivoting operations dynamically change computation and nonzero ll-in structures during the elimination process. This paper presen...

متن کامل

A Comparison of 1-D and 2-D Data Mapping for Sparse LU Factorization with Partial Pivoting

This paper presents a comparative study of two data mapping schemes for parallel sparse LU factorization with partial pivoting on distributed memory machines. Our previous work has developed an approach that incorporates static symbolic factoriza-tion, nonsymmetric L/U supernode partitioning and graph scheduling for this problem with 1-D column-block mapping. The 2-D mapping is commonly conside...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2007